Peterson-Gorenstein-Zierler algorithm for skew RS codes

نویسندگان

  • José Gómez-Torrecillas
  • F. J. Lobillo
  • Gabriel Navarro
چکیده

We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of non-commutative cyclic structure. Since we work over an arbitrary field, our techniques may be applied both to linear block codes and convolutional codes. In particular, our decoding algorithm applies for block codes beyond the classical cyclic case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Low-Cost Multi-Mode Reed Solomon Decoder Design Based on Peterson-Gorenstein-Zierler Algorithm

Reed-Solomon (RS) codes play an important role in providing error protection and data integrity. Among various Reed-Solomon decoding algorithms, the Peterson-Gorenstein-Zierler (PGZ) algorithm in general has the least computational complexity for small t values. However, unlike the iterative approaches (e.g., BerlekampMassey and Euclidean algorithms), it will encounter divided-by-zero problems ...

متن کامل

Malfunction in the Peterson-Gorenstein- Zierler decoder

Most versions of the Peterson-Gorenstein-Zierler (PGZ) decoding algorithm are not true bounded distance decoding algorithms in the sense that when a received vector is not in the decoding sphere of any codeword, the algorithm does not always declare a decoding failure. For a t-error-correcting BCH code, if the received vector is at distance i, i t, from a codeword in a supercode with BCH distan...

متن کامل

Improved Decoding Algorithms for Reed-Solomon Codes

In coding theory, Reed-Solomon codes are one of the most well-known and widely used classes of error-correcting codes. In this thesis we study and compare two major strategies known for their decoding procedure, the Peterson-Gorenstein-Zierler (PGZ) and the Berlekamp-Massey (BM) decoder, in order to improve existing decoding algorithms and propose faster new ones. In particular we study a modif...

متن کامل

Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect

Bose and Chaudhuri (1960) have introduced a class of binary errorcorrecting codes of block length 2 ~ 1, m = 2,3,• • which we refer to here as B-C codes. An efficient decoding scheme has been devised for them by Peterson (1960), and generalized to the natural extension of the B-C Codes to codes in pm symbols by D. Gorenstein and N. Zierler (1960). Two further properties of B-C codes are establi...

متن کامل

G. Richter and S. Plass: Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm, in Proc. of ITG Conference on Source

This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for correcting column and row errors and erasures in an ( ) array. Such errors occur e.g. in magnetic tape recording or in memory chip arrays. For maximum rank distance codes (Rank-Codes), there exists a decoding algorithm similar to the Peterson-Gorenstein-Zierler technique ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1703.00745  شماره 

صفحات  -

تاریخ انتشار 2017